On duality gap in binary quadratic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On duality gap in binary quadratic programming

We present in this paper new results on the duality gap between the binary quadratic optimization problem and its Lagrangian dual or semidefinite programming relaxation. We first derive a necessary and sufficient condition for the zero duality gap and discuss its relationship with the polynomial solvability of the primal problem. We then characterize the zeroness of the duality gap by the dista...

متن کامل

Duality Gap in Interval Linear Programming

This paper deals with the problem of linear programming with inexact data represented by real closed intervals. Optimization problems with interval data arise in practical computations and they are of theoretical interest for more than forty years. We extend the concept of duality gap (DG), the difference between the primal and its dual optimal value, into interval linear programming. We consid...

متن کامل

On a Zero Duality Gap Result in Extended Monotropic Programming

In this note we correct and improve a zero duality gap result in extended monotropic programming given by Bertsekas in [1].

متن کامل

A Duality Theory with Zero Duality Gap for Nonlinear Programming

Duality is an important notion for constrained optimization which provides a theoretical foundation for a number of constraint decomposition schemes such as separable programming and for deriving lower bounds in space decomposition algorithms such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex optimization prob...

متن کامل

On the duality of quadratic minimization problems using pseudo inverses

‎In this paper we consider the minimization of a positive semidefinite quadratic form‎, ‎having a singular corresponding matrix $H$‎. ‎We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method‎. ‎Given this approach and based on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2011

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-011-9683-4